Step of Proof: fincr_formation
12,41
postcript
pdf
Inference at
*
1
I
of proof for Lemma
fincr
formation
:
{
f
|
i
:
if (
i
=
0) then
else {
f
(
i
- 1)...} fi }
latex
by ((With
i
,
j
.
i
<
j
(D 0))
THENW ((Auto_aux (first_nat 1:n) ((first_nat 1:n),(first_nat 3:n
T
)) (first_tok :t) inil_term)))
latex
T
1
: .....aux..... NILNIL
T1:
WellFnd{1}(
;
u
,
v
.(
i
,
j
.
i
<
j
)(
u
,
v
))
T
2
:
T2:
1.
i
:
T2:
2.
f
: {
f
|
i
:{
i1
:
|
i1
(
i
,
j
.
i
<
j
)
i
}
if (
i
=
0) then
else {
f
(
i
- 1)...} fi }
T2:
if (
i
=
0) then
else {
f
(
i
- 1)...} fi
T
.
Definitions
t
T
,
Lemmas
nat
wf
origin